Asymmetric Doob inequalities in continuous time
نویسندگان
چکیده
منابع مشابه
Pseudoconvex Multiobjective Continuous-time Problems and Vector Variational Inequalities
In this paper, the concept of pseudoconvexity and quasiconvexity for continuous~-time functions are studied and an equivalence condition for pseudoconvexity is obtained. Moreover, under pseudoconvexity assumptions, some relationships between Minty and Stampacchia vector variational inequalities and continuous-time programming problems are presented. Finally, some characterizations of the soluti...
متن کاملInequalities for Continuous-time Model for Scheduling of Continuous Processes
This paper presents a mathematical formulation for large-scale continuous process scheduling problem using unit-specific event-based continuous-time representation. The formulation is based on the work of Ierapetritou et al., (1999). The model considers the changeovers for multi-purpose units and tanks, setup constraints for parallel units and tanks, and includes product tanks that satisfy dema...
متن کاملContinuous time portfolio optimization
This paper presents dynamic portfolio model based on the Merton's optimal investment-consumption model, which combines dynamic synthetic put option using risk-free and risky assets. This paper is extended version of methodological paper published by Yuan Yao (2012). Because of the long history of the development of foreign financial market, with a variety of financial derivatives, the study on ...
متن کاملEfficient Continuous-Time Asymmetric Hopfield Networks for Memory Retrieval
A novel m energy functions method is adopted to analyze the retrieval property of continuous-time asymmetric Hopfield neural networks. Sufficient conditions for the local and global asymptotic stability of the network are proposed. Moreover, an efficient systematic procedure for designing asymmetric networks is proposed, and a given set of states can be assigned as locally asymptotically stable...
متن کاملThe Computational Power of Continuous Time Asymmetric Neural Networks
We investigate the computational power of continuous-time neural networks with Hoppeld-type units and asymmetric interconnections. We prove that polynomial-size networks with saturated-linear response functions are at least as powerful as polynomially space-bounded Turing machines .
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Functional Analysis
سال: 2017
ISSN: 0022-1236
DOI: 10.1016/j.jfa.2017.05.001